SAT-Encodings, Search Space Structure, and Local Search Performance
نویسنده
چکیده
Stochastic local search (SLS) algorithms for prepositional satisfiability testing (SAT) have become popular and powerful tools for solving suitably encoded hard combinatorial from different domains like, e.g., planning. Consequently, there is a considerable interest in finding SAT-encodings which facilitate the efficient application of SLS algorithms. In this work, we study how two encodings schemes for combinatorial problems, like the well-known Constraint Satisfaction or Hamilton Circuit Problem, affect SLS performance on the SAT-encoded instances. To explain the observed performance differences, we identify features of the induces search spaces which affect SLS performance. We furthermore present initial results of a comparitive analysis of the performance of the SAT-encoding and -solving approach versus that of native SLS algorithms directly applied to the unencoded problem instances.
منابع مشابه
Local Search on SAT-encoded Colouring Problems
Constraint satisfaction problems can be SAT-encoded in more than one way, and the choice of encoding can be as important as the choice of search algorithm. Theoretical results are few but experimental comparisons have been made between encodings, using both local and backtrack search algorithms. This paper compares local search performance on seven encodings of graph colouring benchmarks. Two o...
متن کاملLocal Search on SAT-Encoded CSPs
Constraint satisfaction problems can be SAT-encoded in more than one way, and the choice of encoding can be as important as the choice of search algorithm. Theoretical results are few but experimental comparisons have been made between encodings, using both local and backtrack search algorithms. This paper compares local search performance on seven encodings of graph colouring benchmarks. Two o...
متن کاملSolving Many-Valued SAT Encodings with Local Search
In this paper we present MV-SAT, which is a many-valued constraint programming language that bridges the gap between Boolean Satisfiability and Constraint Satisfaction. Our overall goal is to extend the SAT formalism with many-valued sets and deal with more compact and natural encodings, as in CSP approaches, while retaining the efficiencies of SAT solvers operating on uniform encodings. After ...
متن کاملReformulating Propositional Satissability as Constraint Satisfaction
We study how propositional satissability (SAT) problems can be reformulated as constraint satisfaction problems (CSPs). We analyse four diierent mappings of SAT problems into CSPs. For each mapping , we compare theoretically the performance of systematic algorithms like FC and MAC applied to the encoding against the Davis-Putnam procedure applied to the original SAT problem. We also compare loc...
متن کاملStochastic Local Search in k-Term DNF Learning
A novel native stochastic local search algorithm for solving k-term DNF problems is presented. It is evaluated on hard k-term DNF problems that lie on the phase transition and compared to the performance of GSAT and WalkSAT type algorithms on SAT encodings of k-term DNF problems. We also evaluate state-of-the-art separate and conquer algorithms on these problems. Finally, we demonstrate the pra...
متن کامل